Randomness notions and partial relativization
نویسندگان
چکیده
We study weak 2 randomness, weak randomness relative to ∅′ and Schnorr randomness relative to ∅′. One major theme is characterizing the oracles A such that ML[A] ⊆ C, where C is a randomness notion and ML[A] denotes the Martin-Löf random reals relative to A. We discuss the connections with LR-reducibility and also study the reducibility associated with weak 2randomness.
منابع مشابه
Uniform Kurtz randomness
We propose studying uniform Kurtz randomness, which is the uniform relativization of Kurtz randomness. This notion has more natural properties than the usual relativization. For instance, van Lambalgen’s theorem holds for uniform Kurtz randomness while not for (the usual relativization of) Kurtz randomness. Another advantage is that lowness for uniform Kurtz randomness has many characterization...
متن کاملRandomness, relativization and Turing degrees
We compare various notions of algorithmic randomness. First we consider relativized randomness. A set is ?-random if it is Martin-L?f random relative to 0_1). We show that a set is 2-random if and only if there is a constant c such that infinitely many initial segments x of the set are c-incompressible: C(x) > |x| ? c. The 'only if direction was obtained independently by Joseph Miller. This cha...
متن کاملCharacterizing Lowness for Demuth Randomness
We show the existence of noncomputable oracles which are low for Demuth randomness, answering a question in [14] (also Problem 5.5.19 in [33]). We fully characterize lowness for Demuth randomness using an appropriate notion of traceability. Central to this characterization is a partial relativization of Demuth randomness, which may be more natural than the fully relativized version. We also sho...
متن کاملRandomness and lowness notions via open covers
One of the main lines of research in algorithmic randomness is that of lowness notions. Given a randomness notion R, we ask for which sequences A does relativization to A leave R unchanged (i.e., RA = R)? Such sequences are call low for R. This question extends to a pair of randomness notions R and S , where S is weaker: for which A is S A still weaker than R? In the last few years, many result...
متن کاملNull-additivity in the Theory of Algorithmic Randomness
In this paper, we develop a general framework integrating algorithmic and higher randomness theories. We clarify the relationship of the notions of triviality and uniform-lowness in algorithmic randomness theory and null-additivity in set theory by effectivizing combinatorial characterizations of transitive additivity in set theory of the real line. For instance, we show that the following thre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009